Assumption-Commitment in Automata
نویسندگان
چکیده
In the study of distributed systems, the assumption-commitment framework is crucial for compositional speciication of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automata-theoretic viewpoint. We present systems of nite state automata which make assumptions about the behaviour of other automata and make commitments about their own behaviour. We characterize the languages accepted by these systems to be the regular trace languages (of Mazurkiewicz) over an associated independence alphabet, and present a syntactic characterization of these languages using top-level parallelism. The results smoothly generalize for automata over innnite words as well.
منابع مشابه
Transformations for Compositional Verification of Assumption-Commitment Properties
This paper presents a transformation-based compositional verification approach for verifying assumption-commitment properties. Our approach improves the verification process by pruning the state space of the model where the assumption is violated. This exclusion is performed by transformation functions which are defined based on a new notion of edges supporting a property. Our approach applies ...
متن کاملModular Analysis of Discrete Controllers for Distributed Hybrid Systems
The algorithmic analysis of control systems for large and distributed hybrid systems is considerably restricted by its computational complexity. In order to enable the verification of discrete controllers for such hybrid systems, this contribution proposes an approach that combines decomposition, model checking and deduction. The system under examination is first decomposed into a set of module...
متن کاملVerification of Hybrid Controlled Processing Systems based on Decomposition and Deduction
While formal verification has been successfully used to analyze several academic examples of controlled hybrid systems, the application to real-world processing systems is largely restricted by the complexity of modeling and computation. This contribution aims at improving the applicability by using decomposition and deduction techniques: A given system is first decomposed into a set of physica...
متن کاملA Presentation of Regular Languages in theAssumption - Commitment
A distributed presentation of a regular language L is a system of communicating automata accepting L, where the constraint on distribution is given in the form of a distributed alphabet. We study such presentations in the assumption-commitment framework , where each process makes assumptions about other processes in the system. Symmetrically, each process makes commitments which the other proce...
متن کاملNorms and Commitment for iOrgs(TM) Information Systems: Direct Logic(TM) and Participatory Grounding Checking
iOrgs TM Information Systems raise important issues for formalizing norms that require extensions and revisions of previous foundational work. For example, extension and revision is required of the fundamental assumption of the Event Calculus: Time-varying properties hold at particular time-points if they have been initiated by an action at some earlier time-point, and not terminated by another...
متن کامل